The BMAP/G/1 -> ./PH/1/M tandem queue with feedback and losses
نویسندگان
چکیده
Tandem queues are good mathematical models of communication systems and networks, so their investigation is important for theory and applications. In this paper, exact analytical analysis of the tandem queue of the BMAP/G/1 → ·/PH/1/M type with customers loss in case when the intermediate buffer is full and with possible feedback is implemented. Possible correlation in the input stream is taken into account by of assuming the Batch Markovian Arrival Process (BMAP). Stability condition for the tandem is derived. Stationary distribution of the system states is derived. Loss probability is calculated. Dependence of the system performance measures on correlation in the input flow, buffer capacity, and feedback probability is numerically illustrated. c © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Tandem queueing system with infinite and finite intermediate buffers and generalized phase-type service time distribution
Keywords: Queueing Tandem queueing system Marked Markovian arrival process Phase-type distribution Laplace–Stieltjes transform a b s t r a c t A tandem queueing system with infinite and finite intermediate buffers, heterogeneous customers and generalized phase-type service time distribution at the second stage is investigated. The first stage of the tandem has a finite number of servers without...
متن کاملTitle: THE M/G/1-TYPE MARKOV CHAIN WITH RESTRICTED TRANSITIONS AND ITS APPLICATION TO QUEUES WITH BATCH ARRIVALS
We consider M/G/1-type Markov chains where a transition that decreases the value of the level triggers the phase to a small subset of the phase space. We show how this structure, referred to as restricted downward transitions, can be exploited to speed-up the computation of the stationary probability vector of the chain. To this end we define a new M/G/1-type Markov chain with a smaller block s...
متن کاملTransient Analysis of the Bmap/ph/1 Queue
We derive in this paper the transient queue length and the busy period distributions of a single server queue with phase-type (PH) service times and a batch Markovian arrival process (BMAP). These distributions are obtained by the uniformization technique which gives simple recurrence relations. The main advantage of this technique is that it leads to stable algorithms for which the precision o...
متن کاملThe BMAP/G/1 QUEUE: A Tutorial
We present an overview of recent results related to the single server queue with general independent and identically distributed service times and a batch Markovian arrival process (BMAP). The BMAP encompasses a wide range of arrival processes and yet, mathematically, the BMAP/G/I model is a relatively simple matrix generalization of the M/G/l queue. Stationary and transient distributions for t...
متن کاملA Tandem BMAP/G/1 → •/M/N/0 Queue with Group Occupation of Servers at the Second Station
We consider a two-stage tandem queue with single-server first station and multiserver second station. Customers arrive to Station 1 according to a batch Markovian arrival process BMAP . A batch may consist of heterogeneous customers. The type of a customer is determined upon completion of a service at Station 1. The customer’s type is classified based on the number of servers required to proces...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Perform. Eval.
دوره 64 شماره
صفحات -
تاریخ انتشار 2007